Design and Analysis of SD_DWCA - A Mobility based clustering of Homogeneous MANETs

This paper deals with the design and analysis of the distributed weighted clustering algorithm SD_DWCA proposed for homogeneous mobile ad hoc networks. It is a connectivity, mobility and energy based clustering algorithm which is suitable for scalable ad hoc networks. The algorithm uses a new graph parameter called strong degree defined based on the quality of neighbours of a node. The parameters are so chosen to ensure high connectivity, cluster stability and energy efficient communication among nodes of high dynamic nature. This paper also includes the experimental results of the algorithm implemented using the network simulator NS2. The experimental results show that the algorithm is suitable for high speed networks and generate stable clusters with less maintenance overhead

A Multi-Hop Weighted Clustering of Homogenous MANETs Using Combined Closeness Index

In this paper, a new multi-hop weighted clustering procedure is proposed for homogeneous Mobile Ad hoc networks. The algorithm generates double star embedded non-overlapping cluster structures, where each cluster is managed by a leader node and a substitute for the leader node (in case of failure of leader node). The weight of a node is a linear combination of six different graph theoretic parameters which deal with the communication capability of a node both in terms of quality and quantity, the relative closeness relationship between network nodes and the maximum and average distance traversed by a node for effective communication. This paper deals with the design and analysis of the algorithm and some of the graph theoretic/structural properties of the clusters obtained are also discussed